Complement-ary matching: a definite maybe

Null Complement Anaphors as definite descriptions ∗

This paper develops the observation that, for many predicates, Null Complement Anaphora (NCA) is like anaphora with a descriptively empty definite description (Condoravdi & Gawron 1996; Gauker 2012). I consider how to distinguish this sort of NCA from pronouns theoretically, and then observe an unnoticed exception to the pattern. For verbs like notice, NCA is neither like a definite description...

Dual Schur Complement Method for Semi-Definite Problems

Semi-definite problems are encountered in a wide variety of engineering problems. Most domain decomposition methods efficient for parallel computing are based on iterative schemes and rarely address the problem of checking the problem’s singularity and computing the null space. In this paper we present a simple and efficient method for checking the singularity of an operator and for computing a...

Strong matching preclusion for k-ary n-cubes

The k-ary n-cube is one of the most popular interconnection networks for parallel and distributed systems. Strong matching preclusion that additionally permits more destructive vertex faults in a graph is amore extensive formof the originalmatching preclusion that assumes only edge faults. In this paper, we establish the strong matching preclusion number and all minimum strong matching preclusi...

Maybe CHI

We describe an experiment in combining multiple interactive media in one collaborative system. While our system supports context–based display of content, it also supports synchronous awareness between visitors using PDA, hypermedia and VR systems. We are also exploring multiple scales of location: buildings on a street, rooms within a building, and spaces within a room. We describe the design ...

On $n$-ary Hypergroups and Fuzzy $n$-ary Homomorphism